De Bruijn and Kautz bus networks
نویسندگان
چکیده
Our aim is to nd bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus and the network diameter. Point-to-point networks are a special case of bus networks in which every bus connects only two processors. In this case de Bruijn and Kautz networks and their generalizations are known to be among the best families of networks with respect to the aforementioned criteria. In this paper, we present the directed de Bruijn bus networks, which connect two or more processors on a bus, and contain the point-to-point de Bruijn networks and their generalization as a special case. We study two diierent schemes of the directed de Bruijn bus networks. We also show that the directed Kautz bus networks can be deened in the same manner.
منابع مشابه
Connectivity and fault-tolerance of hyperdigraphs
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus networks: the connectivity and the fault-diameter of directed hypergraphs. Some bounds are given for those parameters. As a consequence, we obtain that de Bruijn-Kautz directed hypergraphs and, more generally, iterated ...
متن کاملNeighborhood Broadcasting in Undirected de Bruijn and Kautz Networks
This paper considers a neighborhood broadcasting protocol in undirected de Bruijn and Kautz networks. The neighborhood broadcasting problem(NBP) is the problem of disseminating a message from an originator vertex to only its neighbors. Our protocol works under the single-port and half-duplex model and solves NBP in 5 log2(n + 1) + O(1) time units on the undirected de Bruijn graph UB(n, d) with ...
متن کاملBroadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks
We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As ex...
متن کاملBisecting de Bruijn and Kautz Graphs
De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has innuence on both communication properties of the network and the algorithmic design. We prove optimal bounds on the edge and vertex bisection widths of the k-ary n-dimensional ...
متن کاملLine Directed Hypergraphs
In this article we generalize the concept of line digraphs to line dihypergraphs. We give some general properties in particular concerning connectivity parameters of dihypergraphs and their line dihypergraphs, like the fact that the arc connectivity of a line dihypergraph is greater than or equal to that of the original dihypergraph. Then we show that the De Bruijn and Kautz dihypergraphs (whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 30 شماره
صفحات -
تاریخ انتشار 1997